- Consider a triangle represented by A(0, 0), B(1, 1), C(5, 2). The triangle is rotated by 45 degrees about a point P(–1, –1). The co-ordinates of the new triangle obtained after rotation shall be ………………
(A) A'(-1,√2 – 1), B'(-1,2√2 – 1), C'(3/2√2 – 1, 9/2√2 – 1)
(B) A'(√2 – 1, -1), B'(2√2 – 1, -1), C'(3/2√2 – 1, 9/2√2 – 1)
(C) A'(-1, √2 – 1), B'(2√2 – 1, -1), C'(3/2√2 – 1, 9/2√2 – 1)
(D) A'(-1, √2 – 1), B'(2√2 – 1, -1), C'(9/2√2 – 1, 3/2√2 – 1)
Answer: A
- In Cyrus-Beck algorithm for line clipping the value of t parameter is computed by the relation :
(Here P1 and P2 are the two end points of the line, f is a point on the boundary, n1 is inner normal)
Answer: B
- Match the following : I. Cavalier Projection i. The direction of projection is chosen so that there is no foreshortening of lines perpendicular to the xy plane. II. Cabinet Projection ii. The direction of projection is chosen so that lines perpendicular to the xy planes are foreshortened by half their lengths. III. Isometric Projection iii. The direction of projection makes equal angles with all of the principal axis. IV. Orthographic Projection iv. Projections are characterized by the fact that the direction of projection is perpendicular to the view plane.
Codes :
a b c d
(A) i iii iv ii
(B) ii iii i iv
(C) iv ii iii i
(D) i ii iii iv
Answer: D
- Consider the following statements S1, S2 and S3 :
S1 : In call-by-value, anything that is passed into a function call is unchanged in the
caller’s scope when the function returns.
S2 : In call-by-reference, a function receives implicit reference to a variable used as
argument.
S3 : In call-by-reference, caller is unable to see the modified variable used as argument.
(A) S3 and S2 are true. (B) S3 and S1 are true.
(C) S2 and S1 are true. (D) S1, S2, S3 are true.
Answer: C
- How many tokens will be generated by the scanner for the following statement ?
x = x * (a + b) – 5;
(A) 12 (B) 11
(C) 10 (D) 07
Answer: A
- Which of the following statements is not true ?
(A) MPI_Isend and MPI_Irecv are non-blocking message passing routines of MPI.
(B) MPI_Issend and MPI_Ibsend are non-blocking message passing routines of MPI.
(C) MPI_Send and MPI_Recv are non-blocking message passing routines of MPI.
(D) MPI_Ssend and MPI_Bsend are blocking message passing routines of MPI.
Answer: C
- The pushdown automation M = ({q0, q1, q2}, {a, b}, {0, 1}, d, q0, 0, {q0}) with
d (q0, a, 0) = {(q1, 10)}
d (q1, a, 1) = {(q1, 11)}
d (q1, b, 1) = {(q2, l)}
d (q2, b, 1) = {(q2, l)}
d (q2, l, 0) = {(q0, l)}
Accepts the language
(A) L = {an bm | n, m ≥ 0} (B) L = {an bn | n ≥ 0}
(C) L = {an bm | n, m > 0} (D) L = {an bn | n > 0}
Answer: B
- Given two languages :
L1 = {(ab)n ak | n > k, k ≥ 0}
L2 = {an bm | n ¹ m}
Using pumping lemma for regular language, it can be shown that
(A) L1 is regular and L2 is not regular.
(B) L1 is not regular and L2 is regular.
(C) L1 is regular and L2 is regular.
(D) L1 is not regular and L2 is not regular.
Answer: D
- Regular expression for the complement of language L = {an bm | n ≥ 4, m ≤ 3} is
(A) (a + b)* ba(a + b)*
(B) a* bbbbb*
(C) (l + a + aa + aaa)b* + (a + b)* ba(a + b)*
(D) None of the above
Answer: D
- For n devices in a network, ………….. number of duplex-mode links are required for a mesh topology.
(A) n(n + 1) (B) n (n – 1)
(C) n(n + 1)/2 (D) n(n – 1)/2
Answer: D
- How many characters per second (7 bits + 1 parity) can be transmitted over a 3200 bps line if the transfer is asynchronous ? (Assuming 1 start bit and 1 stop bit)
(A) 300 (B) 320
(C) 360 (D) 400
Answer: B
- Which of the following is not a field in TCP header ?
(A) Sequence number (B) Fragment offset
(C) Checksum (D) Window size
Answer: B
- What is the propagation time if the distance between the two points is 48,000 ? Assume the propagation speed to be 2.4 × 108 metre/second in cable.
(A) 0.5 ms (B) 20 ms
(C) 50 ms (D) 200 ms
ANSWER IS D
Explanation.
48000km/(2.4*108)= 48*106m/(2.4*108)= 20×10-2
=200×10-3s.=200ms
- ………….. is a bit-oriented protocol for communication over point-to-point and multipoint links.
(A) Stop-and-wait (B) HDLC
(C) Sliding window (D) Go-back-N
Answer: B
- Which one of the following is true for asymmetric-key cryptography ?
(A) Private key is kept by the receiver and public key is announced to the public.
(B) Public key is kept by the receiver and private key is announced to the public.
(C) Both private key and public key are kept by the receiver.
(D) Both private key and public key are announced to the public.
Answer: A
- Any decision tree that sorts n elements has height
(A) W (n) (B) W (lgn)
(C) W (nlgn) (D) W (n2)
Answer: C
- Match the following :
List – I List – II
- Bucket sort i. O(n3lgn)
- Matrix chain multiplication ii. O(n3)
- Huffman codes iii. O(nlgn)
- All pairs shortest paths iv. O(n)
Codes :
a b c d
(A) iv ii i iii
(B) ii iv i iii
(C) iv ii iii i
(D) iii ii iv i
Answer: C
- We can show that the clique problem is NP-hard by proving that
(A) CLIQUE £ P 3-CNF_SAT
(B) CLIQUE £ P VERTEX_COVER
(C) CLIQUE £ P SUBSET_SUM
(D) None of the above
Answer: D
- Dijkstra algorithm, which solves the single-source shortest–paths problem, is a ……………., and the Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a ……………
(A) Greedy algorithm, Divide-conquer algorithm
(B) Divide-conquer algorithm, Greedy algorithm
(C) Greedy algorithm, Dynamic programming algorithm
(D) Dynamic programming algorithm, Greedy algorithm
Answer: C
- Consider the problem of a chain <A1, A2, A3> of three matrices. Suppose that the dimensions of the matrices are 10 × 100, 100 × 5 and 5 × 50 respectively. There are two different ways of parenthesization : (i) ((A1 A2)A3) and (ii) (A1(A2 A3)). Computing the product according to the first parenthesization is ……………… times faster in comparison to the second parenthesization.
(A) 5 (B) 10
(C) 20 (D) 100
Answer: B
- Suppose that we have numbers between 1 and 1000 in a binary search tree and we want to search for the number 365. Which of the following sequences could not be the sequence of nodes examined ?
(A) 4, 254, 403, 400, 332, 346, 399, 365
(B) 926, 222, 913, 246, 900, 260, 364, 365
(C) 927, 204,913, 242, 914, 247, 365
(D) 4, 401, 389, 221, 268, 384, 383, 280, 365
Answer: C
- Which methods are utilized to control the access to an object in multi-threaded programming ?
(A) Asynchronized methods (B) Synchronized methods
(C) Serialized methods (D) None of the above
Answer: B
- How to express that some person keeps animals as pets ?
Answer: A
- Converting a primitive type data into its corresponding wrapper class object instance is called
(A) Boxing (B) Wrapping
(C) Instantiation (D) Autoboxing
Answer: D
- The behaviour of the document elements in XML can be defined by
(A) Using document object
(B) Registering appropriate event handlers
(C) Using element object
(D) All of the above
Answer: D